Tubular sets and multivariate Polya algorithm

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Polya Conditions for Multivariate Birkhoff Interpolation: from General to Rectangular Sets of Nodes

Polya conditions are certain algebraic inequalities that regular Birkhoff interpolation schemes must satisfy, and they are useful in deciding if a given scheme is regular or not. Here we review the classical Polya condition and then we show how it can be strengthened in the case of rectangular nodes.

متن کامل

Rate of Convergence of the Discrete Polya Algorithm from Convex Sets. a Particular Case

In this work we deal with best approximation in `p , 1 < p ≤ ∞, n ≥ 2. For 1 < p < ∞, let hp denote the best `p -approximation to f ∈ R from a closed, convex subset K of R, f 6∈ K, and let h∗ be a best uniform approximation to f from K. In case that h∗ − f = (ρ1, ρ2, · · · , ρn), |ρj | = ρ for j = 1, 2, · · · , n, we show that the behavior of ‖hp − h∗‖ as p→∞ depends on a property of separation...

متن کامل

Performance of the Viterbi Algorithm on a Polya Channel

The Performance of the Viterbi algorithm with a new Polya contagion noise process is analyzed. The markov channel is the memory channel usually studied in the bibliography. The Polya channel was introduced years ago as a special case of a memory channel. In this work, the Polya contagion scheme is considered as a noise process and a GaussPolya noise model is introduced this way in order to perf...

متن کامل

A 'Gibbs-Newton' Technique for Enhanced Inference of Multivariate Polya Parameters and Topic Models

Hyper-parameters play a major role in the learning and inference process of latent Dirichlet allocation (LDA). In order to begin the LDA latent variables learning process, these hyperparameters values need to be pre-determined. We propose an extension for LDA that we call ‘Latent Dirichlet allocation Gibbs Newton’ (LDA-GN), which places non-informative priors over these hyper-parameters and use...

متن کامل

George Polya

The undisputed father of mathematical problem solving is George Pólya (December 13, 1887 – September 7, 1985), one of the giants of classical analysis in the 20 century. He considered solving problems to be a practical art, one that can be taught and learned. His books on the subject How To Solve It (1945) and the two-volume set Mathematics and Plausible Reasoning (1954), and Mathematical Disco...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of the Australian Mathematical Society. Series A. Pure Mathematics and Statistics

سال: 1993

ISSN: 0263-6115

DOI: 10.1017/s1446788700032043